Equivalence and strong equivalence of actions on handlebodies

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Modular Translations and Strong Equivalence

Given two classes of logic programs, we may be interested in modular translations from one class into the other that are sound wth respect to the answer set semantics. The main theorem of this paper characterizes the existence of such a translation in terms of strong equivalence. The theorem is used to study the expressiveness of several classes of programs, including the comparison of cardinal...

متن کامل

Strong Splitting Bisimulation Equivalence

We present ACP, a process algebra with conditional expressions in which the conditions are taken from a Boolean algebra, and extensions of this process algebra with mechanisms for condition evaluation. We confine ourselves to finitely branching processes. This restriction makes it possible to present ACP in a concise and intuitively clear way, and to bring the notion of splitting bisimulation e...

متن کامل

Strong Shift Equivalence Theory and the Shift Equivalence Problem

This paper discusses strong shift equivalence and counterexamples to the long standing Shift Equivalence Problem in symbolic dynamics. We also discuss how strong shift equivalence theory is closely related to areas of mathematics outside dynamics such as algebraic K-theory, cyclic homology, and topological quantum field theory.

متن کامل

On Strong-Feasibilities of Equivalence-Completions

The notion of completion has been proposed by Francez et al. to transform a non-equivalence-robust fairness notion to an equivalence-robust one while maintaining several properties of the source. However, a completion may not preserve strong-feasibility|a necessary and suucient condition for a completion to be imple-mentable. In this paper, we study the system requirement for a completion to be...

متن کامل

Strong Equivalence of RASP Programs

RASP is a recent extension of Answer Set Programming that permits declarative specification and reasoning on consumption and production of resources. In this paper, we extend the concept of strong equivalence (which, as widely recognized, provides an important conceptual and practical tool for program simplification, transformation and optimization) from ASP to RASP programs and discuss its use...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Transactions of the American Mathematical Society

سال: 1988

ISSN: 0002-9947

DOI: 10.1090/s0002-9947-1988-0951625-5